On the Quality of Partitions Based on Space-Filling Curves
نویسندگان
چکیده
This paper presents bounds on the quality of partitions induced by space-filling curves. We compare the surface that surrounds an arbitrary index range with the optimal partition in the grid, i. e. the square. It is shown that partitions induced by Lebesgue and Hilbert curves behave about 1.85 times worse with respect to the length of the surface. The Lebesgue indexing gives better results than the Hilbert indexing in worst case analysis. Furthermore, the surface of partitions based on the Lebesgue indexing are at most 5 2·√3 times larger than the optimal in average case.
منابع مشابه
Analyzing the Performance of Allocation Strategies Based on Space-Filling Curves
Future exascale supercomputers will be composed of thousands of nodes. In those massive systems, the search for physically close nodes will become essential to deliver an optimal environment to execute parallel applications. Schedulers manage those resources, shared by many users and jobs, searching for partitions in which jobs will run. Significant effort has been devoted to develop allocation...
متن کاملSpace-filling Curves for Domain Decomposition in Scientific Simulations
Space-filling curves(SFC) have been widely accepted as an easy technique to generate good quality mesh partitions. In this work, we discuss the limitations of some of the existing methods for generating SFCs and propose a recursive algorithm for constructing a general SFC that works for a range of meshes in 2D and 3D. All of our test cases for the 2D SFC come from the meshes used in Community E...
متن کاملSpace-filling curves for Partitioning Adaptively Refined Meshes
We present a general space-filling curve algorithm for partitioning an arbitrary 3D mesh. We discuss communication patterns in Adaptive Mesh Refinement (AMR) applications and how we can reduce communication and improve the quality of partitions using a better space-filling curve. We compare the our partitions with those generated using Morton order, which is currently used by majority of AMR so...
متن کاملOptimizing image steganography by combining the GA and ICA
In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...
متن کاملTo Boldly Split: Partitioning Space Filling Curves by Markov Chain Monte Carlo Simulation
Space filling curves are a class of fractals that are important mathematical descriptions of the appearance and shape of natural objects. There is growing interest in the modelling of such curves to measure pathology in medicine and biology. This work presents a method of modelling fractal curves, such as the boundary of brain white matter, and partitioning such curves in to segments having equ...
متن کامل